Letter to the Editor—Attempts to Validate Certain PERT Statistics or “Picking on PERT”

Pert 21

More than half a century after the debut of CPM and PERT, we still lack a project scheduling system with calibrated and validated distributions and without requiring complex user input. Modern decision support systems (DSS) for project management are more sophisticated and comprehensive than PERT/CPM. Nonetheless, in terms of stochastic analysis, they show insufficient progress. PERT 21 offers ...

Interdiction Games on Markovian PERT Networks

In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, while an interdictor endeavors to maximize the project duration by delaying some of the project tasks. We formulate static and dynamic versions of the interdictor’s decision problem where the interdiction plan is either pre-committed or adapts to new information reve...

Dynamic interdiction games on PERT networks

In a PERT network interdiction game one player tries to get a project, represented as a PERT graph, finished as quickly as possible by allocating resources, expediting the project’s tasks and choosing between different technologies to use. At the same time a second player aims to maximally delay the project’s completion date by carefully choosing which tasks to disrupt. We develop a novel conti...

Scheduling Markovian PERT networks to maximize the net present value

We examine project scheduling with net-present-value objective and exponential activity durations, using a continuous-time Markov decision chain. Based on a judicious partitioning of the state space, we achieve a significant performance improvement compared to the existing algorithms.

Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models